Achieving Csiszár's source-channel coding exponent with product distributions
نویسندگان
چکیده
We derive a random-coding upper bound on the average probability of error of joint source-channel coding that recovers Csiszár’s error exponent when used with product distributions over the channel inputs. Our proof technique for the error probability analysis employs a code construction for which source messages are assigned to subsets and codewords are generated with a distribution that depends on the subset.
منابع مشابه
Entropy, Inference, and Channel Coding
This article surveys application of convex optimization theory to topics in Information Theory. Topics include optimal robust algorithms for hypothesis testing; a fresh look at the relationships between channel coding and robust hypothesis testing; and the structure of optimal input distributions in channel coding. A key finding is that the optimal distribution achieving channel capacity is typ...
متن کاملThe Reliability Function of Lossy Source-Channel Coding of Variable-Length Codes with Feedback
We consider transmission of discrete memoryless sources (DMSes) across discrete memoryless channels (DMCs) using variable-length lossy source-channel codes with feedback. The reliability function (optimum error exponent) is shown to be equal to max{0, B(1−R(D)/C)}, where R(D) is the rate-distortion function of the source, B is the maximum relative entropy between output distributions of the DMC...
متن کاملIRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES The Generalized Stochastic Likelihood Decoder: Random Coding and Expurgated Bounds
The likelihood decoder is a stochastic decoder that selects the decoded message at random, using the posterior distribution of the true underlying message given the channel output. In this work, we study a generalized version of this decoder where the posterior is proportional to a general function that depends only on the joint empirical distribution of the output vector and the codeword. This...
متن کاملJoint Source–Channel Coding Excess Distortion Exponent for Some Memoryless Continuous-Alphabet Systems
We investigate the joint source–channel coding (JSCC) excess distortion exponent (the exponent of the probability of exceeding a prescribed distortion level) for some memoryless communication systems with continuous alphabets. We first establish upper and lower bounds for for systems consisting of a memoryless Gaussian source under the squared-error distortion fidelity criterion and a memoryles...
متن کاملAnalogy and duality between random channel coding and lossy source coding
Here we write in a unified fashion (using “R(P,Q,D)” [1]) the random coding exponents in channel coding and lossy source coding. We derive their explicit forms and show, that, for a given random codebook distribution Q, the channel decoding error exponent can be viewed as an encoding success exponent in lossy source coding, and the channel correct-decoding exponent can be viewed as an encoding ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012